The algorithm for computing the Drazin inverses of two-variable polynomial matrices
نویسندگان
چکیده
We propose a finite algorithm for computing Drazin inverse of two-variable polynomial matrices based on Greville s finite algorithm for computing Drazin inverse of a constant matrix. Also a three-dimensional recursive algorithm to do that is deduced. Examples show that these methods are feasible and the implementation is developed in the symbolic package MATLAB. 2002 Elsevier Inc. All rights reserved.
منابع مشابه
Computing the Matrix Geometric Mean of Two HPD Matrices: A Stable Iterative Method
A new iteration scheme for computing the sign of a matrix which has no pure imaginary eigenvalues is presented. Then, by applying a well-known identity in matrix functions theory, an algorithm for computing the geometric mean of two Hermitian positive definite matrices is constructed. Moreover, another efficient algorithm for this purpose is derived free from the computation of principal matrix...
متن کاملGauss-Jordan elimination method for computing outer inverses
This paper deals with the algorithm for computing outer inverse with prescribed range and null space, based on the choice of an appropriate matrix G and Gauss–Jordan elimination of the augmented matrix [G | I]. The advantage of such algorithms is the fact that one can compute various generalized inverses using the same procedure, for different input matrices. In particular, we derive representa...
متن کاملInterpolation algorithm for computing Drazin inverse of polynomial matrices
In this paper we introduce an interpolation method for computing the Drazin inverse of a given polynomial matrix. This method is an extension of the known method from [15], applicable to usual matrix inverse. Also, we improve our interpolation method, using a more effective estimation of degrees of polynomial matrices generated in Leverrier-Faddev method. Algorithms are implemented and tested i...
متن کاملDrazin inverse of one-variable polynomial matrices
There is proposed a representation of the Drazin inverse of a given polynomial square matrix, based on the extension of the Leverrier-Faddeev algorithm. Also, an algorithm for symbolic computation of the Drazin inverse of polynomial matrix is established. This algorithm represents an extension of the papers [5], [7] and a continuation of the papers [8], [9], [10]. The implementation is develope...
متن کاملEffective partitioning method for computing generalized inverses and their gradients
We extend the algorithm for computing {1}, {1, 3}, {1, 4} inverses and their gradients from [11] to the set of multiple-variable rational and polynomial matrices. An improvement of this extension, appropriate to sparse polynomial matrices with relatively small number of nonzero coefficient matrices as well as in the case when the nonzero coefficient matrices are sparse, is introduced. For that ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Applied Mathematics and Computation
دوره 147 شماره
صفحات -
تاریخ انتشار 2004